Improved FFT Approximations of Probability Functions Based on Modified Quadrature Rules

نویسنده

  • Werner Hürlimann
چکیده

In the last ten years, the traditional Simpson quadrature rule for numerical integration has been improved to an optimal 3-point quadrature formula and a modified Simpson rule that takes additionally the first derivative of the approximated integrand at the two end-points of integration into account. The impact of the improved quadrature rules on the fast Fourier transform (FFT) approximation of probability density functions with known characteristic functions is discussed. The quality of the approximations is measured with a discrete version of the total variation distance. Numerical examples suggest that a discrete total variation distance of approximately 0.25 is the best possible attainable value across all the considered FFT approximations. Mathematics Subject Classification: 41A55, 62E17, 65C60, 65T50, 91G60

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of CAS wavelet to construct quadrature rules for numerical ‎integration‎‎

In this paper‎, ‎based on CAS wavelets we present quadrature rules for numerical solution‎ ‎of double and triple integrals with variable limits of integration‎. ‎To construct new method‎, ‎first‎, ‎we approximate the unknown function by CAS wavelets‎. ‎Then by using suitable collocation points‎, ‎we obtain the CAS wavelet coefficients that these coefficients are applied in approximating the unk...

متن کامل

Fast Quadrature Techniques for Retarded Potentials Based on TT/QTT Tensor Approximation

We consider the Galerkin approach for the numerical solution of retarded boundary integral formulations of the three dimensional wave equation in unbounded domains. Recently smooth and compactly supported basis functions in time were introduced which allow the use of standard quadrature rules in order to compute the entries of the boundary element matrix. In this paper, we use TT and QTT tensor...

متن کامل

An Automatic Integration of Infinite Range Integrals Involving Bessel Functions

An efficient automatic quadrature procedure is developed for numerically computing the integrals 0 , where the function is smooth and nonoscillatory at infinity and is the Bessel functions of order ν =1,0 and 1/4. The procedure involves the use of an automatic integration scheme of modified FFT used for evaluating Fourier integrals and product type integration, and the modified W-transformation...

متن کامل

A New Formulation of the Fast Fractional Fourier Transform

By using a spectral approach, we derive a Gaussian-like quadrature of the continuous fractional Fourier transform. The quadrature is obtained from a bilinear form of eigenvectors of the matrix associated to the recurrence equation of the Hermite polynomials. These eigenvectors are discrete approximations of the Hermite functions, which are eigenfunctions of the fractional Fourier transform oper...

متن کامل

Block Gauss and Anti-Gauss Quadrature with Application to Networks

Approximations of matrix-valued functions of the form WT f(A)W , where A ∈ Rm×m is symmetric, W ∈ Rm×k , with m large and k m, has orthonormal columns, and f is a function, can be computed by applying a few steps of the symmetric block Lanczos method to A with initial block-vector W ∈ Rm×k . Golub and Meurant have shown that the approximants obtained in this manner may be considered block Gauss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013